Mathematical Model and Algorithm of Split Load Vehicle Routing Problem with Simultaneous Delivery and Pickup

This paper aims to study the split load vehicle routing problem in order to find a solution which would decrease logistics’ cost by implementing simultaneous delivery and pickup which is part of the multi-attribute vehicle routing problem. A model was established based on certain preconditions and assumptions considering some specific characteristics in this simultaneous delivery and pickup procedure. A tabu search algorithm was applied to obtain the satisfactory solution. In this algorithm, a good initial solution was acquired by using the nearest neighborhood insertion method with the nearest neighbor structured by four operation methods including relocation operation, exchange operation, 2-opt, and the split point reposition operation. A parameter of tabu length was determined by a randomly selecting method, and a penalty function was designed through an automatic adjustment parameter. Data derived from case studies from a subsidiary company of China Railway Express were used to testify to the effectiveness and feasibility of the model and algorithm studied in this paper by comparing characteristics of solution convergence, solution quality and computing time with those of present analogous studies.